Four Classes of Pattern-Avoiding Permutations Under One Roof: Generating Trees with Two Labels
نویسنده
چکیده
Many families of pattern-avoiding permutations can be described by a generating tree in which each node carries one integer label, computed recursively via a rewriting rule. A typical example is that of 123-avoiding permutations. The rewriting rule automatically gives a functional equation satisfied by the bivariate generating function that counts the permutations by their length and the label of the corresponding node of the tree. These equations are now well understood, and their solutions are always algebraic series. Several other families of permutations can be described by a generating tree in which each node carries two integer labels. To these trees correspond other functional equations, defining 3-variate generating functions. We propose an approach to solving such equations. We thus recover and refine, in a unified way, some results on Baxter permutations, 1234-avoiding permutations, 2143-avoiding (or: vexillary) involutions and 54321-avoiding involutions. All the generating functions we obtain are D-finite, and, more precisely, are diagonals of algebraic series. Vexillary involutions are exceptionally simple: they are counted by Motzkin numbers, and thus have an algebraic generating function. In passing, we exhibit an interesting link between Baxter permutations and the Tutte polynomial of planar maps. ∗Partially supported by the European Community IHRP Program, within the Research Training Network ”Algebraic Combinatorics in Europe”, grant HPRN-CT-2001-00272. the electronic journal of combinatorics 9 (2003), #R19 1
منابع مشابه
Four Classes of Pattern-Avoiding Permutations under one Roof: Generating Trees with Two Labels
متن کامل
Generating trees for permutations avoiding generalized patterns
We construct generating trees with with one and two labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, instead of inserting always the largest entry. This allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. W...
متن کاملFinitely labeled generating trees and restricted permutations
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often, the generating tree for the set of permutations avoiding a set of restrictions Q requires infinitely many labels. Sometimes, however, this generating tree needs only finitely many labels. We characterize the finite sets of restrictions Q for which this ...
متن کاملEquipopularity Classes of 132-Avoiding Permutations
The popularity of a pattern p in a set of permutations is the sum of the number of copies of p in each permutation of the set. We study pattern popularity in the set of 132-avoiding permutations. Two patterns are equipopular if, for all n, they have the same popularity in the set of length-n 132-avoiding permutations. There is a well-known bijection between 132-avoiding permutations and binary ...
متن کاملDecompositions and Statistics for Β(1, 0)-trees and Nonseparable Permutations
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack (where the letters on the stack have to be in increasing order) was conjectured by West, and later proved by Zeilberger. Goulden and West found a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره on شماره
صفحات -
تاریخ انتشار 2002